The construction of choice. A computational voting model
نویسندگان
چکیده
Social choice models usually assume that choice is among exogenously given and non decomposable alternatives. Often, on the contrary, choice is among objects that are constructed by individuals or institutions as complex bundles made of many interdependent components. In this paper we present a model of object construction in majority voting and show that, in general, by appropriate changes of such bundles, different social outcomes may be obtained, depending upon initial conditions and agenda, intransitive cycles and median voter dominance may be made appear or disappear, and that, finally, decidability may be ensured by increasing manipulability or viceversa.
منابع مشابه
Convertible limited (multi-) verifier signature: new constructions and applications
A convertible limited (multi-) verifier signature (CL(M)VS) provides controlled verifiability and preserves the privacy of the signer. Furthermore, limited verifier(s) can designate the signature to a third party or convert it into a publicly verifiable signature upon necessity. In this proposal, we first present a generic construction of convertible limited verifier signature (CLVS) into which...
متن کاملA New Voting Model For Groups With Members of Unequal Power and Proficiency
To proposing a voting model for groups with members of unequal power and proficiency, we present some models for rank ordering efficient candidates, by extending the ideas of some authors. Then, we propose a new methodology to rank the ranking models for the performance indices of only DEA efficient candidates based on a classical voting model. Also, an approach for combining the results obtain...
متن کاملVoting and different ranking orders in DEA
Data Envelopment Analysis (DEA) technique now widely use for efficiency evaluation of a set of Decision Making Units (DMUs). As regards of the necessity for ranking efficient units different DEA models presented each of which has advantages and rank efficient units from special aspects. Note that all the existing ranking models have disadvantages, as well and there is not a model in which all t...
متن کاملComputational Social Choice: The First Ten Years and Beyond
Computational social choice is a research area at the intersection of computer science, mathematics, and economics that is concerned with aggregation of preferences of multiple agents. Typical applications include voting, resource allocation, and fair division. This chapter highlights six representative research areas in contemporary computational social choice: restricted preference domains, v...
متن کاملApplication of Voting Geometry to Multialternative Choice
This paper presents an application of voting geometry to individual decision making. We demonstrate that a number of decision anomalies can arise as a natural consequence of the aggregation of preferences of different neural systems. We present a proof of existence of a set of voting procedures that can account for the attraction effect, the similarity effect and the compromise effect, and prov...
متن کامل